An efficient certificateless blind signature scheme without bilinear pairing
نویسندگان
چکیده
منابع مشابه
An efficient identity-based blind signature scheme without bilinear pairings
The blind signature schemes are useful in some applications where the anonymity is a big issue. Examples include the online voting systems and the electronic cash systems. Since the first identity-based blind signature scheme was proposed by Zhang et al., many identity-based blind signature schemes using bilinear pairings have been proposed. But the relative computation cost of the pairing is a...
متن کاملEfficient design of Certificateless Chameleon Signature from Bilinear Pairing
Certificateless public key cryptography (CL-PKC), does not require the use of the certificate to guarantee the authenticity of public keys. It does rely upon the use of a trusted third party (TTP), who is in possession of a master key. CL-PKC does not suffer from the key escrow property. Thus, CL-PKC can be seen as a model for the use in public key cryptography. In this paper, we proposed a new...
متن کاملAn Efficient Certificateless Signature Scheme
Certificateless public key cryptography (CLPKC) is a paradigm to solve the inherent key escrow problem suffered by identity-based cryptography (IBC). While certificateless signature is one of the most important security primitives in CLPKC, there are relatively few proposed schemes in the literature. In this paper, we manage to construct an efficient certificateless signature scheme based on th...
متن کاملAn Efficient Certificateless Proxy Re-Encryption Scheme Without Pairing
Proxy re-encryption (PRE) is a cryptographic primitive introduced by Blaze, Bleumer and Strauss [4] to provide delegation of decryption rights. PRE allows re-encryption of a ciphertext intended for Alice (delegator) to a ciphertext for Bob (delegatee) via a semi-honest proxy, who should not learn anything about the underlying message. In 2003, Al-Riyami and Patterson introduced the notion of ce...
متن کاملAn efficient and provably-secure certificateless signature scheme without bilinear pairings
Many certificateless signature schemes using bilinear pairings have been proposed. But the relative computation cost of the pairing is approximately twenty times higher than that of the scalar multiplication over elliptic curve group. In order to improve the performance we propose a certificateless signature scheme without bilinear pairings. With the running time being saved greatly, our scheme...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Anais da Academia Brasileira de Ciências
سال: 2014
ISSN: 0001-3765
DOI: 10.1590/0001-3765201420130199